B . Bérard , P . Gastin and A . Petit Refinement
نویسندگان
چکیده
Reenement and abstraction are essential operations used in the design of actual systems, real-time or not. We generalize these concepts to sequences of timed actions which are widely used as semantics of real-time behaviors. We obtain two natural, but quite diierent, notions of reenement and abstraction for timed languages depending on whether a timed action is regarded as an action with a duration or as an instantaneous action with a waiting delay. We investigate the closure of timed automata, one of the most widely studied models for real-time systems introduced by Alur and Dill, under reenement and abstraction. Our results deenitely show that the class of timed automata is much more robust if we allow unobservable actions ("-transitions).
منابع مشابه
Refinements and Abstractions of Signal-Event (Timed) Languages
level Concrete level refinement −−−−−−→ ConnectToServer Details used to establish the connection abstraction ←−−−−−− Formalisation of abstraction Let σ : A → P(B) be a substitution. Abstract level Concrete level σ(L) = {w ∈ A | σ(w) ∩ L '= ∅} abstraction ←−−−−−− L ⊆ B 5/29 Adding time to the picture Timed refinement refinement −−−−−−→ Abstract level Concrete level abstraction ←−−−−−− ConnectToS...
متن کاملIntersection of Regular Signal-Event (Timed) Languages
We propose in this paper a construction for a “well known” result: regular signal-event languages are closed by intersection. In fact, while this result is indeed trivial for languages defined by Alur and Dill’s timed automata (the proof is an immediate extension of the one in the untimed case), it turns out that the construction is much more tricky when considering the most involved model of s...
متن کاملTimed substitutions for regular signal-event languages
In the classical framework of formal languages, a refinement operation is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studied, because they describe a change in the specification level, from an abstract view to a more concrete one, or conversely. For timed systems, there is up to now no uniform notion of substitution. In this paper,...
متن کاملP . Gastin , R . Meyer and A . Petit A ( non − elementary ) modular decision procedure for LTrL
Thiagarajan and Walukiewicz 17] have deened a temporal logic LTrL on Mazurkiewicz traces, patterned on the famous proposi-tional temporal logic of linear time LTL deened by Pnueli. They have shown that this logic is equal in expressive power to the rst order theory of nite and innnite traces. The hopes to get an "easy" decision procedure for LTrL, as it is the case for LTL, vanished very recent...
متن کامل